From rubber bands to rational maps: a research report
نویسندگان
چکیده
منابع مشابه
Voting with rubber bands, weights, and strings
We introduce some new voting rules based on a spatial version of the median in R known as the mediancentre, or Fermat-Weber point. Voting rules based on the mean include many that are familiar: the Borda Count, Kemeny rule, approval voting, etc. (see [35], [36]). These mean rules can be implemented by “voting machines” (interactive simulations of physical mechanisms) that use ideal rubber bands...
متن کاملRubber Bands, Pursuit Games and Shy Couplings
In this paper, we consider pursuit-evasion and probabilistic consequences of some geometric notions for bounded and suitably regular domains in Euclidean space that are CAT(κ) for some κ > 0. These geometric notions are useful for analyzing the related problems of (a) existence/nonexistence of successful evasion strategies for the Man in Lion and Man problems, and (b) existence/nonexistence of ...
متن کاملRubber bands, convex embeddings and graph connectivity
We give various characterizations of k-vertex connected graphs by geometric, algebraic, and "physical" properties. As an example, a graph G is k-connected ff and only if, specifying any k vertices of G, the vertices of G can be represented by points of R ~-a so that no k are on a hyper-. plane and each vertex is in the convex hull of its neighbors, except for the k specified vertices. The proof...
متن کاملConstructing Subdivision Rules from Rational Maps
This paper deepens the connections between critically finite rational maps and finite subdivision rules. The main theorem is that if f is a critically finite rational map with no periodic critical points, then for any sufficiently large integer n the iterate f is the subdivision map of a finite subdivision rule. We are interested here in connections between finite subdivision rules and rational...
متن کاملLocally Recoverable codes from rational maps
We point some contributions to the construction of Locally Recoverable codes from algebraic curves recently presented by A. Barg, I. Tamo and S. Vladut, that can lead to improvements concerning the definition, the parameters and the local recovering of these codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in the Mathematical Sciences
سال: 2016
ISSN: 2197-9847
DOI: 10.1186/s40687-015-0039-4